An algorithm for discrete approximation by quasi-convex functions on Rm
نویسندگان
چکیده
منابع مشابه
A HYBRID ALGORITHM FOR SIZING AND LAYOUT OPTIMIZATION OF TRUSS STRUCTURES COMBINING DISCRETE PSO AND CONVEX APPROXIMATION
An efficient method for size and layout optimization of the truss structures is presented in this paper. In order to this, an efficient method by combining an improved discrete particle swarm optimization (IDPSO) and method of moving asymptotes (MMA) is proposed. In the hybrid of IDPSO and MMA, the nodal coordinates defining the layout of the structure are optimized with MMA, and afterwards the...
متن کاملConvex Functions on Discrete Sets
We propose definitions of digital convex sets and digital convex functions and relate them to a refined definition of digital hyperplanes.
متن کاملQuasi-convex Functions and Quasi-monotone Operators
The notions of a quasi-monotone operator and of a cyclically quasi-monotone operator are introduced, and relations between such operators and quasi-convex functions are established.
متن کاملAn Algorithm for $L_\infty$ Approximation by Step Functions
We give an algorithm for determining an optimal step function approximation of weighted data, where the error is measured with respect to the L∞ norm. The algorithm takes Θ(n+ log n · b(1 + log n/b)) time and Θ(n) space, where b is the number of steps. Thus the time is Θ(n log n) in the worst case and Θ(n) when b = O(n/ log n log log n). A minor change determines the optimal reduced isotonic re...
متن کاملAn Algorithm for L∞ Approximation by Step Functions
We give an algorithm for determining an optimal step function approximation of weighted data, where the error is measured with respect to the L∞ norm. The algorithm takes Θ(n+ log n · b(1 + log n/b)) time and Θ(n) space, where b is the number of steps. Thus the time is Θ(n log n) in the worst case and Θ(n) when b = O(n/ log n log log n). A minor change determines the optimal reduced isotonic re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2004
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2004.06.023